Discrepancy norm: Approximation and variations
نویسندگان
چکیده
منابع مشابه
Discrepancy norm: Approximation and variations
This paper introduces an approach for the minimization of the discrepancy norm. The general idea is to replace the infinity norms appearing in the definition by L norms which are differentiable and to make use of this approximation for local optimization. We will show that the discrepancy norm can be approximated up to any ε and the robustness of this approximation is shown. Moreover, analytica...
متن کاملApproximation-Friendly Discrepancy Rounding
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative rounding. We provide an extension of the discrepancy-based rounding algorithm due to Lovett-Meka that (i) combines the advantages of both randomized and iterat...
متن کاملNorm-Graphs: Variations and Applications
We describe several variants of the norm-graphs introduced by Kollár, Rónyai, and Szabó and study some of their extremal properties. Using these variants we construct, for infinitely many values of n, a graph on n vertices with more than 12n 5/3 edges, containing no copy of K3,3, thus slightly improving an old construction of Brown. We also prove that the maximum number of vertices in a complet...
متن کاملApproximation of Multi-color Discrepancy
In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to c colors. We give a recursive method that constructs c{colorings from approximations to the 2{color discrepancy. This method works for a large class of theorems like the six{standard{deviation theorem of Spencer, the Beck{Fiala theorem and the results of ...
متن کاملParsimonious Least Norm Approximation
A theoretically justiiable fast nite successive linear approximation algorithm is proposed for obtaining a parsimonious solution to a corrupted linear system Ax = b + p, where the corruption p is due to noise or error in measurement. The proposed linear-programming-based algorithm nds a solution x by parametrically minimizing the number of nonzero elements in x and the error k Ax ? b ? p k 1. N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2014
ISSN: 0377-0427
DOI: 10.1016/j.cam.2014.05.012